Duality Theory and Approximate Dynamic Programming for Pricing American Options and Portfolio Optimization1

نویسندگان

  • Martin B. Haugh
  • Leonid Kogan
چکیده

This chapter describes how duality and approximate dynamic programming (ADP) methods can be used in financial engineering. It focuses on American option pricing and portfolio optimization problems when the underlying state space is highdimensional. In general, it is not possible to solve these problems exactly due to the so-called “curse of dimensionality” and as a result, approximate solution techniques are required. ADP and dual-based methods have been proposed for constructing and evaluating good approximate solutions to these problems. In this chapter we describe these methods. Some directions for future research are also outlined.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Duality Theory and Approximate Dynamic Programming for Pricing American Options and Portfolio Optimization

This chapter describes how duality and approximate dynamic programming (ADP) methods can be used in financial engineering. It focuses on American option pricing and portfolio optimization problems when the underlying state space is high-dimensional. In general, it is not possible to solve these problems exactly due to the so-called “curse of dimensionality” and as a result, approximate solution...

متن کامل

Duality Theory and Simulation in Financial Engineering

This paper presents a brief introduction to the use of duality theory and simulation in financial engineering. It focuses on American option pricing and portfolio optimization problems when the underlying state space is high-dimensional. In general, it is not possible to solve these problems exactly due to the so-called “curse of dimensionality” and as a result, approximate solution techniques ...

متن کامل

Portfolio Optimization with Position Constraints: an Approximate Dynamic Programming Approach

We analyze dynamic portfolio choice problems using an approximate dynamic programming (ADP) algorithm. We extend the algorithm to the case of constraints on borrowing and implement a duality-based simulation procedure for estimating bounds on the true value function. We demonstrate that the ADP solution exhibits a high degree of accuracy in the considered examples, indicating that this is a pro...

متن کامل

15 Markov Decision Processes in Finance and Dynamic Options

In this paper a discrete-time Markovian model for a nancial market is chosen. The fundamental theorem of asset pricing relates the existence of a martingale measure to the no-arbitrage condition. It is explained how to prove the theorem by stochastic dynamic programming via portfolio optimization. The approach singles out certain martingale measures with additional interesting properties. Furth...

متن کامل

Approximate Dynamic Programming (ADP) and Dual Methods for Pricing American Options

It is only recently that simulation has begun to play an important role in pricing high-dimensional American options. This was due to the fact that since Monte Carlo simulation generally works forward in time while dynamic programming works backwards, it was generally believed that the two were somewhat incompatible. Research in recent years has shown that this is not the case and that Monte Ca...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007